RDFS_(c) Schema Inconsistency Checking Based on a Key Instance and Its Query Rewriting

The introduction of a constraint mechanism to the resource description framework schema (RDFS) poses challenges for keeping RDFS ontologies consistent, particularly in presence reasoning rules (RRs). This study presents method detect inconsistencies given enhanced RDFS, termed $_{\mathrm {(c)}}$ , under set RRs. can be used efficiently infer type qualifications and constraints that may violated when RRs are applied graph instances schema. First, concept an internal is developed, conversion examined. An more versatile than corresponding original language. Second, key established as basis detecting inconsistencies. number considerably smaller instances, resulting significantly higher detection efficiency. Moreover, rigorous formal proof ensure generated based on semantically equivalent Finally, algorithm provided extends by query rewriting constructs potential violate constraints. minimality ensures minimum constructed, thereby further improving efficiency inferring violations. Test results show enhance proposed superior relevant methods terms time performance.